No Visible Stars
نویسندگان
چکیده
منابع مشابه
Edge-Colorings with No Large Polychromatic Stars
Given a graph G and a positive integer r, let f r (G) denote the largest number of colors that can be used in a coloring of E(G) such that each vertex is incident to at most r colors. For all positive integers n and r, we determine f r (K n;n) exactly and f r (K n) within 1. In doing so, we disprove a conjecture by Manoussakis, Spyratos, Tuza and Voigt in 4].
متن کاملNo photocatalyst required--versatile, visible light mediated transformations with polyhalomethanes.
A visible light mediated, but photocatalyst-free method for the oxidative α-CH functionalization of tertiary amines with a broad scope of carbon- and heteroatom nucleophiles using polyhalomethanes has been developed. In addition, the pivotal visible light triggered activation of polyhalomethanes offers mild conditions for efficient Kharasch-type additions onto non-activated olefins. Preliminary...
متن کاملNo Evidence for Prolonged Visible Persistence in Patients with Schizophrenia
BACKGROUND Temporal visual processing is strongly deteriorated in patients with schizophrenia. For example, the interval required between a visual stimulus and a subsequent mask has to be much longer in schizophrenic patients than in healthy controls. We investigated whether this deficit in temporal resolution is accompanied by prolonged visual persistence and/or deficient temporal precision (t...
متن کاملA&a Manuscript No. the Brightest Carbon Stars
It is currently accepted that Hot-Bottom-Burning (HBB) in intermediate-mass asymptotic giant branch (AGB) stars prevents the formation of C stars. Nevertheless, we present in this paper the results of some detailed evolutionary calculations which show that even with HBB we obtain C stars at the highest luminosities reached on the AGB. This is due to mass-loss reducing the envelope mass so that ...
متن کاملUnweighted p-center problem on extended stars
An extended star is a tree which has only one vertex with degree larger than two. The -center problem in a graph asks to find a subset of the vertices of of cardinality such that the maximum weighted distances from to all vertices is minimized. In this paper we consider the -center problem on the unweighted extended stars, and present some properties to find solution.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: An Homage to Ezra Pound
سال: 1985
ISSN: 0021-065X,2330-0361
DOI: 10.17077/0021-065x.3195